Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
نویسندگان
چکیده
منابع مشابه
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation
We study the problem of estimating the value of sums of the form Sp A Z (g) when one has the ability to sample xi ;> 0 with probability proportional to its magnitude. When p = 2, this problem is equivalent to estimating the selectivity of a self-join query in database systems when one can sample rows randomly. We also study the special case when {x} is the degree sequence of a graph, which corr...
متن کاملCounting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algorithms and unifies several well known results in algorithms and combinatorics including the recent algorithm of Björklund, Husfeldt and Koivisto for computing the chromatic polynomial, the classical algorithm of Kohn, Go...
متن کاملSublinear-Time Approximation for Clustering Via Random Sampling
In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum k-clustering, and balanced k-median. For all these problems we consider the following simple sampling scheme: select a small sample set of points uniformly at random from V and then run some approximation algorithm on this sample set to compute an approximati...
متن کاملFaster Algorithms for Finding and Counting Subgraphs
Given an input graph G and an integer k, the k-PATH problem asks whether there exists a path of length k in G. The counting version of the problem, #k-PATH asks to find the number of paths of length k in G. Recently, there has been a lot of work on finding and counting k-sized paths in an input graph. The current fastest (randomized) algorithm for k-PATH has been given by Williams and it runs i...
متن کاملSublinear Time Approximate Sum via Uniform Random Sampling
We investigate the approximation for computing the sum a1 + · · ·+ an with an input of a list of nonnegative elements a1, · · · , an. If all elements are in the range [0, 1], there is a randomized algorithm that can compute an (1+ ǫ)-approximation for the sum problem in time O( log n) ∑n i=1 ai ), where ǫ is a constant in (0, 1). Our randomized algorithm is based on the uniform random sampling,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0287-3